| 翻訳と辞書 |
| Maximum independent set problem ： ウィキペディア英語版 |
Independent set (graph theory)
In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set ''I'' of vertices such that for every two vertices in ''I'', there is no edge connecting the two. Equivalently, each edge in the graph has at most one endpoint in ''I''. The size of an independent set is the number of vertices it contains. Independent sets have also been called internally stable sets.
A maximal independent set is either an independent set such that adding any other vertex to the set forces the set to contain an edge or the set of all vertices of the empty graph.
A maximum independent set is an independent set of largest possible size for a given graph ''G''. This size is called the independence number of ''G'', and denoted ''α''(''G'').〔, p. 3.〕 The problem of finding such a set is called the maximum independent set problem and is an NP-hard optimization problem. As such, it is unlikely that there exists an efficient algorithm for finding a maximum independent set of a graph.
Every maximum independent set also is maximal, but the converse implication does not necessarily hold.
==Properties==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Independent set (graph theory)」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|